منابع مشابه
Parallel Single-Source Shortest Paths
We designed and implemented a parallel algorithm for solving the single-source shortest paths (SSSP) problem for graphs with nonnegative edge weights, based on Gabow’s scaling algorithm for SSSP. This parallel Gabow algorithm attains a theoretical parallelism of Ω(E/(V lg∆ lgE/D)) in the worst case and Ω(E/(D lgV/D lgE/D lgDelta)with high probability on a random graph. In practice this algorith...
متن کاملImplementing parallel shortest-paths algorithms
We have implemented a parallel version of the Bellman-Ford algorithm for the single-source shortest paths problem. Our software has been developed on the CM-5 using C with CMMD communication primitives. We have empirically compared the eeciency of our implementation with a sequential implementation of the Bellman-Ford-Moore algorithm developed by Cherkassky, Goldberg and Radzik. We have perform...
متن کاملLongest Paths in Series-Parallel Graphs
In 1966 Gallai asked whether all longest paths in a connected graph intersect in a common vertex. This is not true in general and various counterexamples have been found. However, many well-known classes of graphs have the socalled Gallai property, e.g. trees and outerplanar graphs. Recently, de Rezende et al. proved that 2-trees, which are maximal series-parallel graphs, also have this propert...
متن کاملOn Parallel Rectilinear Obstacle-avoiding Paths
We give improved space and processor complexities for the problem of computing, in parallel, a data structure that supports queries about shortest rectilinear obstacleavoiding paths in the plane, where the obstacles are disjoint rectangles. That is, a query specifies any source and destination in the plane, and the data structure enables efficient processing of the query. We now can build the d...
متن کاملBuckets Strike Back: Improved Parallel Shortest Paths
We study the average-case complexity of the parallel single-source shortest-path (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0; 1℄. We provide a new bucket-based parallel SSSP algorithm that runs in T = O(log2 n minif2i L + jVijg) average-case time using O(n+m+T ) work on a PRAM where L denotes the maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Neuroscience
سال: 2013
ISSN: 1471-003X,1471-0048
DOI: 10.1038/nrn3560